Bent Function Synthesis by Means of Cartesian Genetic Programming
نویسندگان
چکیده
In this paper, a new approach to synthesize bent Boolean functions by means of Cartesian Genetic Programming (CGP) is proposed. Bent functions have important applications in cryptography due to their high nonlinearity. However, they are very rare and their discovery using conventional brute force methods is not efficient enough. We show that by using CGP we can routinely design bent functions of up to 16 variables. The evolutionary approach exploits parallelism in both the fitness calculation and the search algorithm.
منابع مشابه
Constructive Induction of Fuzzy Cartesian Granule Feature Models using Genetic Programming
The G_DACG (Genetic Discovery of Additive Cartesian Granule feature models) constructive induction algorithm is presented as a means of automatically identifying rulebased Cartesian granule feature models from example data. G_DACG combines the powerful search capabilities of genetic programming with a rather novel and cheap fitness function based upon the semantic separation of learnt concepts ...
متن کاملConstructive Induction of Fuzzy Cartesian Granule Feature Models using Genetic Programming with applications
Cartesian granule features are derived features that are formed over the cross product of words that linguistically partition the universes of the constituent input features. Both classification and prediction problems can be modelled quite naturally in terms of Cartesian granule features incorporated into rule-based models. The induction of Cartesian granule feature models involves discovering...
متن کاملEvolution of Robot Controller Using Cartesian Genetic Programming
Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolution through neutral search. Here, an integer based version of the representation is applied to a traditional problem in the field: evolving an obstacle avoiding robot controller. The technique is used to rapidly evolve controll...
متن کاملIsothermal Reactor Network Synthesis Using Coupled NonDominated Sorting Genetic Algorithm-II (NSGAII) with Quasi Linear Programming (LP) Method
In this study a new and robust procedure is presented to solve synthesis of isothermal reactor networks (RNs) which considers more than one objective function. This <span style="font-size: 9pt; color: #0...
متن کاملSynthesis of Adder Circuit Using Cartesian Genetic Programming
Digital adders form a significant part of the arithmetic unit in the processors. Many Digital Signal Processing (DSP) algorithms equally uses adder and multiplier element as its component to achieve the required arithmetic operation. Hence it is important to optimize the adder circuit in the gate-level itself to design it for the required standards. Recently there are various bio-inspired optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014